Some Combinatorial Aspects of Reduced Words in Finite Coxeter Groups
نویسنده
چکیده
We analyze the structure of reduced expressions in the Coxeter groups An, Bn and Dn. Several special classes of elements are singled out for their connections with symmetric functions or the theory of P -partitions. Membership in these special classes is characterized in a variety of ways, including forbidden patterns, forbidden subwords, and by the form of canonically chosen reduced words.
منابع مشابه
Some combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملA combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups
(1) The Poincar e polynomials of the nite irreducible Coxeter groups and the Poincar e series of the aane Coxeter groups on three generators are derived by an elementary combinatorial method avoiding the use of Lie theory and invariant theory. (2) Non-recursive methods for the computation of`standard reduced words' for (signed) permutations are described. The algebraic basis for both (1) and (2...
متن کاملA Hecke Algebra Quotient and Some Combinatorial Applications
Let (W, S) be a Coxeter group associated to a Coxeter graph which has no multiple bonds. Let H be the corresponding Hecke Algebra. We define a certain quotient H of H and show that it has a basis parametrized by a certain subset Wc of the Coxeter group w. Specifically, Wc consists of those elements of W all of whose reduced expressions avoid substrings of the form sts where s and t are noncommu...
متن کاملThe Weak Order of Coxeter Systems and Combinatorial Properties of Descent Sets
In this paper, we study the weak order of Coxeter systems and the combinatorial properties of descent sets. There are three main results: (1) Given a Coxeter system (W,S), some word v ∈W , some subset A ⊆ S disjoint fromDR(v), and some w ∈WA, we proved that DR(vw) ⊆ DR(v) ∪ A. (2) We obtained an explicit map for A ∪ B to dominate B in the case when A,B are commuting disjoint sets, with B finite...
متن کاملin Algebra . Coxeter groups and Hecke algebras
The finite Coxeter groups are the finite groups generated by reflections on real Euclidean spaces. Examples include dihedral groups, the symmetry groups of regular polytopes (e.g. regular polygons and platonic solids) and the Weyl groups of semisimple complex Lie groups and Lie algebras (such as the special linear group and Lie algebra). General Coxeter groups may be defined as certain (special...
متن کامل